RkNN Query Algorithm Based on K-order Voronoi Diagram
نویسندگان
چکیده
منابع مشابه
K-order Spatial Neighbours Based on Voronoi Diagram: Description, Computation and Applications
Spatial neighbouring relation is a very important concept in spatial information science. It has even been regarded as the base of spatial information system. Neighouring information is indispensable for many operations in spatial information system. Therefore, it is significant to describe and acquire such in an efficient way. Most of current concepts of neighbours only involve objects sharing...
متن کاملAn Incremental Algorithm for High Order Maximum Voronoi Diagram Construction
We propose an incremental approach to compute the order-k maximum Voronoi diagram of disks in the plane. In our approach, we start with an order-k Voronoi diagram of disk centers and iteratively expand disks and update the changes of the diagram until all disks reach their targeted size. When disks expand continuously, the structure of the diagram changes discretely. The algorithm takes O (⌈ rm...
متن کاملVoronoi Diagram Generation Algorithm based on Delaunay Triangulation
Voronoi diagram and its geometric dual, the Delaunay triangulation, both are practical geometric constructions which have been applied extensively in spatial analysis. Considering the low efficiency of the algorithm of indirectly building Voronoi diagram, this paper proposes an improved Voronoi diagram generation algorithm based on Delaunay triangulation of randomly distributed points in the Eu...
متن کاملTime - Based Voronoi Diagram ∗
We consider a variation of Voronoi diagram, or time-based Voronoi diagram, for a set S of points in the presence of transportation lines or highways in the plane. A shortest time-distance path from a query point to any given point in S is a path that takes the least travelling time. The travelling speeds and hence travelling times of the subpaths along the highways and in the plane are differen...
متن کاملRobustness of k-gon Voronoi diagram construction
In this paper, we present a plane sweep algorithm for constructing the Voronoi diagram of a set of non-crossing line segments in 2D space using a distance metric induced by a regular k-gon and study the robustness of the algorithm. Following the algorithmic degree model [G. Liotta, F.P. Preparata, R. Tamassia, Robust proximity queries: an illustration of degree-driven algorithm design, SIAM J. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Control and Automation
سال: 2014
ISSN: 2005-4297,2005-4297
DOI: 10.14257/ijca.2014.7.9.02